Midterm II. Introduction to Artificial Intelligence. CS 188 Fall ˆ You have approximately 3 hours.
|
|
- Lenard Gardner
- 5 years ago
- Views:
Transcription
1 CS 188 Fall 2012 Introduction to Artificial Intelligence Midterm II ˆ You have approximately 3 hours. ˆ The exam is closed book, closed notes except a one-page crib sheet. ˆ Please use non-programmable calculators only. ˆ Mark your answers ON THE EXAM ITSELF. If you are not sure of your answer you may wish to provide a brief explanation. All short answer sections can be successfully answered in a few sentences AT MOST. First name Last name SID EdX username First and last name of student to your left First and last name of student to your right For staff use only: Q1. December 21, 2012 /10 Q2. ayes Nets Representation /16 Q3. Variable Elimination /13 Q4. ayes Nets Sampling /10 Q5. Probability and Decision Networks /15 Q6. Election /12 Q7. Naïve ayes Modeling Assumptions /6 Q8. Model Structure and Laplace Smoothing /7 Q9. ML: Short Question & Answer /11 Total /100 1
2 THIS PAGE IS INTENTIONALLY LEFT LANK
3 Q1. [10 pts] December 21, 2012 A smell of sulphur (S) can be caused either by rotten eggs (E) or as a sign of the doom brought by the Mayan Apocalypse (M). The Mayan Apocalypse also causes the oceans to boil (). The ayesian network and corresponding conditional probability tables for this situation are shown below. For each part, you should give either a numerical answer (e.g. 0.81) or an arithmetic expression in terms of numbers from the tables below (e.g ). Note: be careful of doing unnecessary computation here. P (E) +e 0.4 e 0.6 P (S E, M) +e +m +s 1.0 +e +m s 0.0 +e m +s 0.8 +e m s 0.2 e +m +s 0.3 e +m s 0.7 e m +s 0.1 e m s 0.9 E S M P (M) +m 0.1 m 0.9 P ( M) +m +b 1.0 +m b 0.0 m +b 0.1 m b 0.9 (a) [2 pts] Compute the following entry from the joint distribution: P ( e, s, m, b) = (b) [2 pts] What is the probability that the oceans boil? P (+b) = (c) [2 pts] What is the probability that the Mayan Apocalypse is occurring, given that the oceans are boiling? P (+m + b) = 3
4 The figures and table below are identical to the ones on the previous page and are repeated here for your convenience. P (E) +e 0.4 e 0.6 P (S E, M) +e +m +s 1.0 +e +m s 0.0 +e m +s 0.8 +e m s 0.2 e +m +s 0.3 e +m s 0.7 e m +s 0.1 e m s 0.9 E S M P (M) +m 0.1 m 0.9 P ( M) +m +b 1.0 +m b 0.0 m +b 0.1 m b 0.9 (d) [2 pts] What is the probability that the Mayan Apocalypse is occurring, given that there is a smell of sulphur, the oceans are boiling, and there are rotten eggs? P (+m + s, +b, +e) = (e) [2 pts] What is the probability that rotten eggs are present, given that the Mayan Apocalypse is occurring? P (+e + m) = 4
5 Q2. [16 pts] ayes Nets Representation (a) [6 pts] Graph Structure: Conditional Independence Consider the ayes net given below. A C D E F AG H Remember that X Y reads as X is independent of Y given nothing, and X Y {Z, W } reads as X is independent of Y given Z and W. For each expression, fill in the corresponding circle to indicate whether it is True or False. (i) True False It is guaranteed that A (ii) True False It is guaranteed that A C (iii) True False It is guaranteed that A D {, H} (iv) True False It is guaranteed that A E F (v) True False It is guaranteed that G E (vi) True False It is guaranteed that F C D (vii) True False It is guaranteed that E D (viii) True False It is guaranteeed that C H G 5
6 (b) Graph structure: Representational Power Recall that any directed acyclic graph G has an associated family of probability distributions, which consists of all probability distributions that can be represented by a ayes net with structure G. For the following questions, consider the following six directed acyclic graphs: A C A C A G 1 G 2 G 3 C A C A C A G 4 G 5 G 6 C (i) [2 pts] Assume all we know about the joint distribution P (A,, C) is that it can be represented by the product P (A, C)P ( C)P (C). Mark each graph for which the associated family of probability distributions is guaranteed to include P (A,, C). G 1 G 2 G 3 G 4 G 5 G 6 (ii) [2 pts] Now assume all we know about the joint distribution P (A,, C) is that it can be represented by the product P (C )P ( A)P (A). Mark each graph for which the associated family of probability distributions is guaranteed to include P (A,, C). G 1 G 2 G 3 G 4 G 5 G 6 6
7 (c) Marginalization and Conditioning Consider a ayes net over the random variables A,, C, D, E with the structure shown below, with full joint distribution P (A,, C, D, E). The following three questions describe different, unrelated situations (your answers to one question should not influence your answer to other questions). A C D E (i) [2 pts] Consider the marginal distribution P (A,, D, E) = c P (A,, c, D, E), where C was eliminated. On the diagram below, draw the minimal number of arrows that results in a ayes net structure that is able to represent this marginal distribution. If no arrows are needed write No arrows needed. A D E (ii) [2 pts] Assume we are given an observation: A = a. On the diagram below, draw the minimal number of arrows that results in a ayes net structure that is able to represent the conditional distribution P (, C, D, E A = a). If no arrows are needed write No arrows needed. C D E (iii) [2 pts] Assume we are given two observations: D = d, E = e. On the diagram below, draw the minimal number of arrows that results in a ayes net structure that is able to represent the conditional distribution P (A,, C D = d, E = e). If no arrows are needed write No arrows needed. A C 7
8 Q3. [13 pts] Variable Elimination For the ayes net shown on the right, we are given the query P (, D +f). All variables have binary domains. Assume we run variable elimination to compute the answer to this query, with the following variable elimination ordering: A, C, E, G. A C D E F G (a) Complete the following description of the factors generated in this process: After inserting evidence, we have the following factors to start out with: P (A), P ( A), P (C ), P (D C), P (E C, D), P (+f C, E), P (G C, +f) When eliminating A we generate a new factor f 1 as follows: f 1 () = a P (a)p ( a) This leaves us with the factors: P (C ), P (D C), P (E C, D), P (+f C, E), P (G C, +f), f 1 () (i) [2 pts] When eliminating C we generate a new factor f 2 as follows: This leaves us with the factors: (ii) [2 pts] When eliminating E we generate a new factor f 3 as follows: This leaves us with the factors: (iii) [2 pts] When eliminating G we generate a new factor f 4 as follows: This leaves us with the factors: (b) [2 pts] Explain in one sentence how P (, D + f) can be computed from the factors left in part (iii) of (a)? (c) [1 pt] Among f 1, f 2,..., f 4, which is the largest factor generated, and how large is it? Assume all variables have binary domains and measure the size of each factor by the number of rows in the table that would represent the factor. For your convenience, the ayes net from the previous page is shown again below. 8
9 A C D E F G (d) [4 pts] Find a variable elimination ordering for the same query, i.e., for P (, D +f), for which the maximum size factor generated along the way is smallest. Hint: the maximum size factor generated in your solution should have only 2 variables, for a table size of 2 2 = 4. Fill in the variable elimination ordering and the factors generated into the table below. Variable Eliminated Factor Generated For example, in the naive ordering we used earlier, the first line in this table would have had the following two entries: A, f 1 (). For this question there is no need to include how each factor is computed, i.e., no need to include expressions of the type = a P (a)p ( a). 9
10 Q4. [10 pts] ayes Nets Sampling Assume the following ayes net, and the corresponding distributions over the variables in the ayes net: A C D P (A) a 3/4 +a 1/4 P ( A) a b 2/3 a +b 1/3 +a b 4/5 +a +b 1/5 P (C ) b c 1/4 b +c 3/4 +b c 1/2 +b +c 1/2 P (D C) c d 1/8 c +d 7/8 +c d 5/6 +c +d 1/6 (a) You are given the following samples: +a + b c d +a b + c d a + b + c d a b + c d +a b c + d +a + b + c d a + b c + d a b + c d (i) [1 pt] Assume that these samples came from performing Prior Sampling, and calculate the sample estimate of P (+c). (ii) [2 pts] Now we will estimate P (+c +a, d). Above, clearly cross out the samples that would not be used when doing Rejection Sampling for this task, and write down the sample estimate of P (+c +a, d) below. (b) [2 pts] Using Likelihood Weighting Sampling to estimate P ( a +b, d), the following samples were obtained. Fill in the weight of each sample in the corresponding row. Sample a + b + c d +a + b + c d +a + b c d a + b c d Weight (c) [1 pt] From the weighted samples in the previous question, estimate P ( a +b, d). (d) [2 pts] Which query is better suited for likelihood weighting, P (D A) or P (A D)? Justify your answer in one sentence. 10
11 (e) [2 pts] Recall that during Gibbs Sampling, samples are generated through an iterative process. Assume that the only evidence that is available is A = +a. Clearly fill in the circle(s) of the sequence(s) below that could have been generated by Gibbs Sampling. Sequence 1 1 : +a b c +d 2 : +a b c +d 3 : +a b +c +d Sequence 3 1 : +a b c +d 2 : +a b c d 3 : +a +b c d Sequence 2 1 : +a b c +d 2 : +a b c d 3 : a b c +d Sequence 4 1 : +a b c +d 2 : +a b c d 3 : +a +b c +d 11
12 Q5. [15 pts] Probability and Decision Networks The new Josh ond Movie (M), Skyrise, is premiering later this week. Skyrise will either be great (+m) or horrendous ( m); there are no other possible outcomes for its quality. Since you are going to watch the movie no matter what, your primary choice is between going to the theater (theater) or renting (rent) the movie later. Your utility of enjoyment is only affected by these two variables as shown below: (a) [3 pts] Maximum Expected Utility Compute the following quantities: EU(theater) = M P(M) +m 0.5 -m 0.5 M A U(M,A) +m theater 100 -m theater 10 +m rent 80 -m rent 40 EU(rent) = MEU({}) = Which action achieves MEU({}) = 12
13 (b) [3 pts] Fish and Chips Skyrise is being released two weeks earlier in the U.K. than the U.S., which gives you the perfect opportunity to predict the movie s quality. Unfortunately, you don t have access to many sources of information in the U.K., so a little creativity is in order. You realize that a reasonable assumption to make is that if the movie (M) is great, citizens in the U.K. will celebrate by eating fish and chips (F ). Unfortunately the consumption of fish and chips is also affected by a possible food shortage (S), as denoted in the below diagram. The consumption of fish and chips (F ) and the food shortage (S) are both binary variables. The relevant conditional probability tables are listed below: S M F P (F S, M) +s +m +f 0.6 +s +m -f 0.4 +s -m +f 0.0 +s -m -f 1.0 S M F P (F S, M) -s +m +f 1.0 -s +m -f 0.0 -s -m +f 0.3 -s -m -f 0.7 S P (S) +s 0.2 -s 0.8 You are interested in the value of revealing the food shortage node (S). Answer the following queries: EU(theater + s) = EU(rent + s) = MEU({+s}) = Optimal Action Under {+s} = MEU({ s}) = Optimal Action Under { s} = V P I(S) = 13
14 (c) [5 pts] Greasy Waters You are no longer concerned with the food shortage variable. Instead, you realize that you can determine whether the runoff waters are greasy (G) in the U.K., which is a variable that indicates whether or not fish and chips have been consumed. The prior on M and utility tables are unchanged. Given this different model of the problem: G F P (G F ) +g +f 0.8 -g +f 0.2 +g -f 0.3 -g -f 0.7 F M P (F M) +f +m f +m f -m f -m 0.76 M P(M) +m 0.5 -m 0.5 M A U(M,A) +m theater 100 -m theater 10 +m rent 80 -m rent 40 [Decision network] [Tables that define the model] F P (F ) +f f 0.42 G P (G) +g g 0.41 M G P (M G) +m +g m +g m -g m -g G M P (G M) +g +m g +m g -m g -m M F P (M F ) +m +f m +f m -f m -f [Tables computed from the first set of tables. Some of them might be convenient to answer the questions below] Answer the following queries: MEU(+g) = MEU( g) = V P I(G) = 14
15 (d) VPI Comparisons We consider the shortage variable (S) again, resulting in the decision network shown below. The (conditional) probability tables for P (S), P (M), P (F S, M) and P (G F ) are the ones provided above. The utility function is still the one shown in part (a). Circle all statements that are true, and provide a brief justification (no credit without justification). (i) [1 pt] V P I(S) : V P I(S) < 0 V P I(S) = 0 V P I(S) > 0 V P I(S) = V P I(F ) V P I(S) = V P I(G) Justify: (ii) [1 pt] V P I(S G) : V P I(S G) < 0 V P I(S G) = 0 V P I(S G) > 0 V P I(S G) = V P I(F ) V P I(S G) = V P I(G) Justify: (iii) [1 pt] V P I(G F ) : V P I(G F ) < 0 V P I(G F ) = 0 V P I(G F ) > 0 V P I(G F ) = V P I(F ) V P I(G F ) = V P I(G) Justify: (iv) [1 pt] V P I(G) : V P I(G) = 0 V P I(G) > 0 V P I(G) > V P I(F ) V P I(G) < V P I(F ) V P I(G) = V P I(F ) Justify: 15
16 Q6. [12 pts] Election The country of Purplestan is preparing to vote on its next President! In this election, the incumbent President Purple is being challenged by the ambitious upstart Governor Fuschia. Purplestan is divided into two states of equal population, Redexas and lue York, and the lue York Times has recruited you to help track the election. R t S R t t t+1 R t+1 St N St+1 N S t S R t+1 S t+1 Drift and Error Models x D(x) E R (x) E (x) E N (x) To begin, you draw the dynamic ayes net given above, which includes the President s true support in Redexas and lue York (denoted R t and t respectively) as well as weekly survey results. Every week there is a survey of each state, S R t and S t, and also a national survey S N t whose sample includes equal representation from both states. The model s transition probabilities are given in terms of the random drift model D(x) specified in the table above: P (R t+1 R t ) = D(R t+1 R t ) P ( t+1 t ) = D( t+1 t ) Here D(x) gives the probability that the support in each state shifts by x between one week and the next. Similarly, the observation probabilities are defined in terms of error models E R (x), E (x), and E N (x): P (S R t R t ) = E R (S R t R t ) P (St t ) = E (St t ) ( P (St N R t, t ) = E N St N R ) t + t 2 where the error model for each survey gives the probability that it differs by x from the true support; the different error models represent the surveys differing polling methodologies and sample sizes. Note that St N depends on both R t and t, since the national survey gives a noisy average of the President s support across both states. (a) Particle Filtering. First we ll consider using particle filtering to track the state of the electorate. Throughout this problem, you may give answers either as unevaluated numeric expressions (e.g ) or as numeric values (e.g. 0.36). (i) [2 pts] Suppose we begin in week 1 with the two particles listed below. Now we observe the first week s surveys: S R 1 = 51, S 1 = 45, and S N 1 = 50. Write the weight of each particle given this evidence: Particle Weight (r = 49, b = 47) (r = 52, b = 48) 16
17 The figures and table below are identical to the ones on the previous page and are repeated here for your convenience. R t S R t t S t R t+1 t+1 S N t S N t+1 S R t+1 S t+1 Drift and Error Models x D(x) E R (x) E (x) E N (x) (ii) [2 pts] Now we resample the particles based on their weights; suppose our resulting particle set turns out to be {(r = 52, b = 48), (r = 52, b = 48)}. Now we pass the first particle through the transition model to produce a hypothesis for week 2. What s the probability that the first particle becomes (r = 50, b = 48)? (iii) [2 pts] In week 2, disaster strikes! A hurricane knocks out the offices of the company performing the lue York state survey, so you can only observe S R 2 = 48 and S N 2 = 50 (the national survey still incorporates data from voters in lue York). ased on these observations, compute the weight for each of the two particles: Particle Weight (r = 50, b = 48) (r = 49, b = 53) 17
18 (iv) [4 pts] Your editor at the Times asks you for a now-cast prediction of the election if it were held today. The election directly measures the true support in both states, so R 2 would be the election result in Redexas and t the result in lue York. To simplify notation, let I 2 = (S1 R, S1, S1 N, S2 R, S2 N ) denote all of the information you observed in weeks 1 and 2, and also let the variable W i indicate whether President Purple would win an election in week i: { 1 if R i+ i W i = 2 > 50 0 otherwise. For improved accuracy we will work with the weighted particles rather than resampling. Normally we would build on top of step (iii), but to decouple errors, let s assume that after step (iii) you ended up with the following weights: Particle Weight (r = 50, b = 48).12 (r = 49, b = 53).18 Note this is not actually what you were supposed to end up with! Using the weights from this table, estimate the following quantities: ˆ The current probability that the President would win: P (W 2 = 1 I 2 ) ˆ Expected support for President Purple in lue York: E[ 2 I 2 ] (v) [2 pts] The real election is being held next week (week 3). Suppose you are representing the current joint belief distribution P (R 2, 2 I 2 ) with a large number of unweighted particles. Explain using no more than two sentences how you would use these particles to forecast the national election (i.e. how you would estimate P (W 3 = 1 I 2 ), the probability that the President wins in week 3, given your observations from weeks 1 and 2). 18
19 Q7. [6 pts] Naïve ayes Modeling Assumptions You are given points from 2 classes, shown as rectangles and dots. For each of the following sets of points, mark if they satisfy all the Naïve ayes modelling assumptions, or they do not satisfy all the Naïve ayes modelling assumptions. Note that in (c), 4 rectangles overlap with 4 dots f f f f 1 (a) Satisfies Does not Satisfy (b) Satisfies Does not Satisfy f f f f 1 (c) Satisfies Does not Satisfy (d) Satisfies Does not Satisfy f f 1 f f 1 (e) Satisfies Does not Satisfy (f) Satisfies Does not Satisfy 19
20 Q8. [7 pts] Model Structure and Laplace Smoothing We are estimating parameters for a ayes net with structure G A and for a ayes net with structure G. To estimate the parameters we use Laplace smoothing with k = 0 (which is the same as maximum likelihood), k = 5, and k =. GA G Let for a given ayes net N the corresponding joint distribution over all variables in the ayes net be P N then the likelihood of the training data for the ayes net N is given by P N (x i ) x i Training Set Let L 0 A denote the likelihood of the training data for the ayes net with structure G A and parameters learned with Laplace smoothing with k = 0. Let L 5 A denote the likelihood of the training data for the ayes net with structure G A and parameters learned with Laplace smoothing with k = 5. Let L A denote the likelihood of the training data for the ayes net with structure G A and parameters learned with Laplace smoothing with k =. We similarly define L 0, L5, L for structure G. For each of the questions below, mark which one is the correct option. (a) [1 pt] Consider L 0 A and L5 A L 0 A L5 A L 0 A L5 A L 0 A = L5 A Insufficient information to determine the ordering. (b) [1 pt] Consider L 5 A and L A L 5 A L A L 5 A L A L 5 A = L A Insufficient information to determine the ordering. (c) [1 pt] Consider L 0 and L L 0 L L 0 L L 0 = L Insufficient information to determine the ordering. (d) [1 pt] Consider L 0 A and L0 L 0 A L0 L 0 A L0 L 0 A = L0 Insufficient information to determine the ordering. (e) [1 pt] Consider L A and L L A L L A L L A = L Insufficient information to determine the ordering. (f) [1 pt] Consider L 5 A and L0 L 5 A L0 L 5 A L0 L 5 A = L0 Insufficient information to determine the ordering. (g) [1 pt] Consider L 0 A and L5 L 0 A L5 L 0 A L5 L 0 A = L5 Insufficient information to determine the ordering. 20
21 Q9. [11 pts] ML: Short Question & Answer (a) Parameter Estimation and Smoothing. For the ayes net drawn on the left, A can take on values +a, a, and can take values +b and b. We are given samples (on the right), and we want to use them to estimate P (A) and P ( A). ( a, +b) ( a, +b) ( a, b) ( a, b) A ( a, b) ( a, b) ( a, +b) ( a, +b) ( a, b) (+a, +b) (i) [3 pts] Compute the maximum likelihood estimates for P (A) and P ( A), and fill them in the 2 tables on the right. A +a -a P (A) A P ( A) +a +b +a -b -a +b -a -b (ii) [3 pts] Compute the estimates for P (A) and P ( A) using Laplace smoothing with strength k = 2, and fill them in the 2 tables on the right. A +a -a P (A) A P ( A) +a +b +a -b -a +b -a -b (b) [2 pts] Linear Separability. You are given samples from 2 classes (. and +) with each sample being described by 2 features f 1 and f 2. These samples are plotted in the following figure. You observe that these samples are not linearly separable using just these 2 features. Circle the minimal set of features below that you could use alongside f 1 and f 2, to linearly separate samples from the 2 classes f 1 < 1.5 f 1 > 1.5 f 2 < 1 f f 1 > 1.5 f 2 < 1 f 2 > 1 f 1 + f 2 f f 1 < 1.5 f 2 > 1 f f 1 Even using all these features alongside f 1 and f 2 will not make the samples linearly separable. (c) [3 pts] Perceptrons. In this question you will perform perceptron updates. You have 2 classes, +1 and 1, and 3 features f 0, f 1, f 2 for each training point. The +1 class is predicted if w f > 0 and the 1 class is predicted otherwise. You start with the weight vector, w = [1 0 0]. In the table below, do a perceptron update for each of the given samples. If the w vector does not change, write No Change, otherwise write down the new w vector. f 0 f 1 f 2 Class Updated w
Midterm II. Introduction to Artificial Intelligence. CS 188 Fall You have approximately 3 hours.
CS 188 Fall 2012 Introduction to Artificial Intelligence Midterm II You have approximately 3 hours. The exam is closed book, closed notes except a one-page crib sheet. Please use non-programmable calculators
More information1. A Not So Random Walk
CS188 Fall 2018 Section 9: Midterm 2 Prep 1. A Not So Random Walk Pacman is trying to predict the position of a ghost, which he knows has the following transition graph: p q 1 1 p 1 q A B C Here, 0 < p
More informationMidterm II. Introduction to Artificial Intelligence. CS 188 Spring ˆ You have approximately 1 hour and 50 minutes.
CS 188 Spring 2013 Introduction to Artificial Intelligence Midterm II ˆ You have approximately 1 hour and 50 minutes. ˆ The exam is closed book, closed notes except a one-page crib sheet. ˆ Please use
More information1. A Not So Random Walk
CS88 Fall 208 Section 9: Midterm 2 Prep. A Not So Random Walk Pacman is trying to predict the position of a ghost, which he knows has the following transition graph: p q p q A B C Here, 0 < p < and 0
More informationMidterm II. Introduction to Artificial Intelligence. CS 188 Spring ˆ You have approximately 1 hour and 50 minutes.
CS 188 Spring 2013 Introduction to Artificial Intelligence Midterm II ˆ You have approximately 1 hour and 50 minutes. ˆ The exam is closed book, closed notes except a one-page crib sheet. ˆ Please use
More informationMidterm 2 V1. Introduction to Artificial Intelligence. CS 188 Spring 2015
S 88 Spring 205 Introduction to rtificial Intelligence Midterm 2 V ˆ You have approximately 2 hours and 50 minutes. ˆ The exam is closed book, closed calculator, and closed notes except your one-page crib
More informationˆ The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
CS 188 Summer 2015 Introduction to Artificial Intelligence Midterm 2 ˆ You have approximately 80 minutes. ˆ The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
More informationCS 188 Fall Introduction to Artificial Intelligence Midterm 2
CS 188 Fall 2013 Introduction to rtificial Intelligence Midterm 2 ˆ You have approximately 2 hours and 50 minutes. ˆ The exam is closed book, closed notes except your one-page crib sheet. ˆ Please use
More informationFinal. Introduction to Artificial Intelligence. CS 188 Spring You have approximately 2 hours and 50 minutes.
CS 188 Spring 2014 Introduction to Artificial Intelligence Final You have approximately 2 hours and 50 minutes. The exam is closed book, closed notes except your two-page crib sheet. Mark your answers
More informationThe exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
CS 188 Fall 2018 Introduction to Artificial Intelligence Practice Final You have approximately 2 hours 50 minutes. The exam is closed book, closed calculator, and closed notes except your one-page crib
More informationThe exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
CS 188 Fall 2015 Introduction to Artificial Intelligence Final You have approximately 2 hours and 50 minutes. The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
More informationIntroduction to Artificial Intelligence Midterm 2. CS 188 Spring You have approximately 2 hours and 50 minutes.
CS 188 Spring 2014 Introduction to Artificial Intelligence Midterm 2 You have approximately 2 hours and 50 minutes. The exam is closed book, closed notes except your two-page crib sheet. Mark your answers
More informationIntroduction to Fall 2009 Artificial Intelligence Final Exam
CS 188 Introduction to Fall 2009 Artificial Intelligence Final Exam INSTRUCTIONS You have 3 hours. The exam is closed book, closed notes except a two-page crib sheet. Please use non-programmable calculators
More informationCS 188 Fall Introduction to Artificial Intelligence Midterm 2
CS 188 Fall 2013 Introduction to rtificial Intelligence Midterm 2 ˆ You have approximately 2 hours and 50 minutes. ˆ The exam is closed book, closed notes except your one-page crib sheet. ˆ Please use
More informationIntroduction to Spring 2009 Artificial Intelligence Midterm Exam
S 188 Introduction to Spring 009 rtificial Intelligence Midterm Exam INSTRUTINS You have 3 hours. The exam is closed book, closed notes except a one-page crib sheet. Please use non-programmable calculators
More informationMark your answers ON THE EXAM ITSELF. If you are not sure of your answer you may wish to provide a brief explanation.
CS 189 Spring 2015 Introduction to Machine Learning Midterm You have 80 minutes for the exam. The exam is closed book, closed notes except your one-page crib sheet. No calculators or electronic items.
More informationFinal Exam December 12, 2017
Introduction to Artificial Intelligence CSE 473, Autumn 2017 Dieter Fox Final Exam December 12, 2017 Directions This exam has 7 problems with 111 points shown in the table below, and you have 110 minutes
More informationFinal Exam December 12, 2017
Introduction to Artificial Intelligence CSE 473, Autumn 2017 Dieter Fox Final Exam December 12, 2017 Directions This exam has 7 problems with 111 points shown in the table below, and you have 110 minutes
More informationThe exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
CS 88 Fall 208 Introduction to Artificial Intelligence Practice Final You have approximately 2 hours 50 minutes. The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
More informationFinal. Introduction to Artificial Intelligence. CS 188 Spring You have approximately 2 hours and 50 minutes.
CS 188 Spring 2013 Introduction to Artificial Intelligence Final You have approximately 2 hours and 50 minutes. The exam is closed book, closed notes except a three-page crib sheet. Please use non-programmable
More informationThe exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
CS 188 Spring 2017 Introduction to Artificial Intelligence Midterm V2 You have approximately 80 minutes. The exam is closed book, closed calculator, and closed notes except your one-page crib sheet. Mark
More informationMidterm. Introduction to Machine Learning. CS 189 Spring You have 1 hour 20 minutes for the exam.
CS 189 Spring 2013 Introduction to Machine Learning Midterm You have 1 hour 20 minutes for the exam. The exam is closed book, closed notes except your one-page crib sheet. Please use non-programmable calculators
More informationIntroduction to Spring 2006 Artificial Intelligence Practice Final
NAME: SID#: Login: Sec: 1 CS 188 Introduction to Spring 2006 Artificial Intelligence Practice Final You have 180 minutes. The exam is open-book, open-notes, no electronics other than basic calculators.
More informationCS 188 Introduction to Fall 2007 Artificial Intelligence Midterm
NAME: SID#: Login: Sec: 1 CS 188 Introduction to Fall 2007 Artificial Intelligence Midterm You have 80 minutes. The exam is closed book, closed notes except a one-page crib sheet, basic calculators only.
More informationCS188: Artificial Intelligence, Fall 2010 Written 3: Bayes Nets, VPI, and HMMs
CS188: Artificial Intelligence, Fall 2010 Written 3: Bayes Nets, VPI, and HMMs Due: Tuesday 11/23 in 283 Soda Drop Box by 11:59pm (no slip days) Policy: Can be solved in groups (acknowledge collaborators)
More informationName (NetID): (1 Point)
CS446: Machine Learning Fall 2016 October 25 th, 2016 This is a closed book exam. Everything you need in order to solve the problems is supplied in the body of this exam. This exam booklet contains four
More informationFinal. CS 188 Fall Introduction to Artificial Intelligence
S 188 Fall 2012 Introduction to rtificial Intelligence Final You have approximately 3 hours. The exam is closed book, closed notes except your three one-page crib sheets. Please use non-programmable calculators
More informationMachine Learning, Midterm Exam: Spring 2008 SOLUTIONS. Q Topic Max. Score Score. 1 Short answer questions 20.
10-601 Machine Learning, Midterm Exam: Spring 2008 Please put your name on this cover sheet If you need more room to work out your answer to a question, use the back of the page and clearly mark on the
More informationMidterm, Fall 2003
5-78 Midterm, Fall 2003 YOUR ANDREW USERID IN CAPITAL LETTERS: YOUR NAME: There are 9 questions. The ninth may be more time-consuming and is worth only three points, so do not attempt 9 unless you are
More informationMidterm Exam, Spring 2005
10-701 Midterm Exam, Spring 2005 1. Write your name and your email address below. Name: Email address: 2. There should be 15 numbered pages in this exam (including this cover sheet). 3. Write your name
More informationMachine Learning, Fall 2009: Midterm
10-601 Machine Learning, Fall 009: Midterm Monday, November nd hours 1. Personal info: Name: Andrew account: E-mail address:. You are permitted two pages of notes and a calculator. Please turn off all
More informationFinal Exam, Fall 2002
15-781 Final Exam, Fall 22 1. Write your name and your andrew email address below. Name: Andrew ID: 2. There should be 17 pages in this exam (excluding this cover sheet). 3. If you need more room to work
More informationIntroduction to Machine Learning Midterm, Tues April 8
Introduction to Machine Learning 10-701 Midterm, Tues April 8 [1 point] Name: Andrew ID: Instructions: You are allowed a (two-sided) sheet of notes. Exam ends at 2:45pm Take a deep breath and don t spend
More informationIntroduction to Fall 2008 Artificial Intelligence Midterm Exam
CS 188 Introduction to Fall 2008 Artificial Intelligence Midterm Exam INSTRUCTIONS You have 80 minutes. 70 points total. Don t panic! The exam is closed book, closed notes except a one-page crib sheet,
More informationMIDTERM: CS 6375 INSTRUCTOR: VIBHAV GOGATE October,
MIDTERM: CS 6375 INSTRUCTOR: VIBHAV GOGATE October, 23 2013 The exam is closed book. You are allowed a one-page cheat sheet. Answer the questions in the spaces provided on the question sheets. If you run
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science ALGORITHMS FOR INFERENCE Fall 2014
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.438 ALGORITHMS FOR INFERENCE Fall 2014 Quiz 2 Wednesday, December 10, 2014 7:00pm 10:00pm This is a closed
More informationThe exam is closed book, closed notes except your one-page (two sides) or two-page (one side) crib sheet.
CS 189 Spring 013 Introduction to Machine Learning Final You have 3 hours for the exam. The exam is closed book, closed notes except your one-page (two sides) or two-page (one side) crib sheet. Please
More informationCSE 546 Final Exam, Autumn 2013
CSE 546 Final Exam, Autumn 0. Personal info: Name: Student ID: E-mail address:. There should be 5 numbered pages in this exam (including this cover sheet).. You can use any material you brought: any book,
More informationCS221 Practice Midterm
CS221 Practice Midterm Autumn 2012 1 ther Midterms The following pages are excerpts from similar classes midterms. The content is similar to what we ve been covering this quarter, so that it should be
More informationMidterm exam CS 189/289, Fall 2015
Midterm exam CS 189/289, Fall 2015 You have 80 minutes for the exam. Total 100 points: 1. True/False: 36 points (18 questions, 2 points each). 2. Multiple-choice questions: 24 points (8 questions, 3 points
More informationMachine Learning, Midterm Exam: Spring 2009 SOLUTION
10-601 Machine Learning, Midterm Exam: Spring 2009 SOLUTION March 4, 2009 Please put your name at the top of the table below. If you need more room to work out your answer to a question, use the back of
More informationMidterm. Introduction to Artificial Intelligence. CS 188 Summer You have approximately 2 hours and 50 minutes.
CS 188 Summer 2014 Introduction to Artificial Intelligence Midterm You have approximately 2 hours and 50 minutes. The exam is closed book, closed notes except your one-page crib sheet. Mark your answers
More informationFINAL: CS 6375 (Machine Learning) Fall 2014
FINAL: CS 6375 (Machine Learning) Fall 2014 The exam is closed book. You are allowed a one-page cheat sheet. Answer the questions in the spaces provided on the question sheets. If you run out of room for
More informationExam 2 MAS 3105 Applied Linear Algebra, Spring 2018
Exam 2 MAS 3105 Applied Linear Algebra, Spring 2018 (Clearly!) Print Name: Mar 8, 2018 Read all of what follows carefully before starting! 1. This test has 6 problems and is worth 100 points. Please be
More informationFinal. CS 188 Fall Introduction to Artificial Intelligence
CS 188 Fall 2012 Introduction to Artificial Intelligence Final You have approximately 3 hours. The exam is closed book, closed notes except your three one-page crib sheets. Please use non-programmable
More informationMachine Learning Practice Page 2 of 2 10/28/13
Machine Learning 10-701 Practice Page 2 of 2 10/28/13 1. True or False Please give an explanation for your answer, this is worth 1 pt/question. (a) (2 points) No classifier can do better than a naive Bayes
More informationFinal. Introduction to Artificial Intelligence. CS 188 Summer 2014
S 188 Summer 2014 Introduction to rtificial Intelligence Final You have approximately 2 hours and 50 minutes. The exam is closed book, closed notes except your two-page crib sheet. Mark your answers ON
More informationIntroduction to Fall 2008 Artificial Intelligence Final Exam
CS 188 Introduction to Fall 2008 Artificial Intelligence Final Exam INSTRUCTIONS You have 180 minutes. 100 points total. Don t panic! The exam is closed book, closed notes except a two-page crib sheet,
More informationMIDTERM SOLUTIONS: FALL 2012 CS 6375 INSTRUCTOR: VIBHAV GOGATE
MIDTERM SOLUTIONS: FALL 2012 CS 6375 INSTRUCTOR: VIBHAV GOGATE March 28, 2012 The exam is closed book. You are allowed a double sided one page cheat sheet. Answer the questions in the spaces provided on
More informationQualifier: CS 6375 Machine Learning Spring 2015
Qualifier: CS 6375 Machine Learning Spring 2015 The exam is closed book. You are allowed to use two double-sided cheat sheets and a calculator. If you run out of room for an answer, use an additional sheet
More informationCS 188: Artificial Intelligence Spring Announcements
CS 188: Artificial Intelligence Spring 2011 Lecture 12: Probability 3/2/2011 Pieter Abbeel UC Berkeley Many slides adapted from Dan Klein. 1 Announcements P3 due on Monday (3/7) at 4:59pm W3 going out
More informationName (NetID): (1 Point)
CS446: Machine Learning (D) Spring 2017 March 16 th, 2017 This is a closed book exam. Everything you need in order to solve the problems is supplied in the body of this exam. This exam booklet contains
More informationCSE 150. Assignment 6 Summer Maximum likelihood estimation. Out: Thu Jul 14 Due: Tue Jul 19
SE 150. Assignment 6 Summer 2016 Out: Thu Jul 14 ue: Tue Jul 19 6.1 Maximum likelihood estimation A (a) omplete data onsider a complete data set of i.i.d. examples {a t, b t, c t, d t } T t=1 drawn from
More informationCIS519: Applied Machine Learning Fall Homework 5. Due: December 10 th, 2018, 11:59 PM
CIS59: Applied Machine Learning Fall 208 Homework 5 Handed Out: December 5 th, 208 Due: December 0 th, 208, :59 PM Feel free to talk to other members of the class in doing the homework. I am more concerned
More informationMachine Learning, Midterm Exam
10-601 Machine Learning, Midterm Exam Instructors: Tom Mitchell, Ziv Bar-Joseph Wednesday 12 th December, 2012 There are 9 questions, for a total of 100 points. This exam has 20 pages, make sure you have
More informationˆ The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
S 88 Summer 205 Introduction to rtificial Intelligence Final ˆ You have approximately 2 hours 50 minutes. ˆ The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
More informationMath 110 (Fall 2018) Midterm II (Monday October 29, 12:10-1:00)
Math 110 (Fall 2018) Midterm II (Monday October 29, 12:10-1:00) Name: SID: Please write clearly and legibly. Justify your answers. Partial credits may be given to Problems 2, 3, 4, and 5. The last sheet
More informationDepartment of Computer and Information Science and Engineering. CAP4770/CAP5771 Fall Midterm Exam. Instructor: Prof.
Department of Computer and Information Science and Engineering UNIVERSITY OF FLORIDA CAP4770/CAP5771 Fall 2016 Midterm Exam Instructor: Prof. Daisy Zhe Wang This is a in-class, closed-book exam. This exam
More informationCS540 ANSWER SHEET
CS540 ANSWER SHEET Name Email 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 1 2 Final Examination CS540-1: Introduction to Artificial Intelligence Fall 2016 20 questions, 5 points
More informationCS188 Fall 2018 Section 7: Bayes Nets and Decision Nets
CS188 Fall 2018 Section 7: Bayes Nets and Decision Nets 1 Bayes Nets: Inference Assume we are given the following Bayes net, and would like to perform inference to obtain P (B, D E = e, H = h). A B C D
More informationCS446: Machine Learning Fall Final Exam. December 6 th, 2016
CS446: Machine Learning Fall 2016 Final Exam December 6 th, 2016 This is a closed book exam. Everything you need in order to solve the problems is supplied in the body of this exam. This exam booklet contains
More informationFINAL EXAM: FALL 2013 CS 6375 INSTRUCTOR: VIBHAV GOGATE
FINAL EXAM: FALL 2013 CS 6375 INSTRUCTOR: VIBHAV GOGATE You are allowed a two-page cheat sheet. You are also allowed to use a calculator. Answer the questions in the spaces provided on the question sheets.
More informationHidden Markov Models. Vibhav Gogate The University of Texas at Dallas
Hidden Markov Models Vibhav Gogate The University of Texas at Dallas Intro to AI (CS 4365) Many slides over the course adapted from either Dan Klein, Luke Zettlemoyer, Stuart Russell or Andrew Moore 1
More informationBayesian Networks BY: MOHAMAD ALSABBAGH
Bayesian Networks BY: MOHAMAD ALSABBAGH Outlines Introduction Bayes Rule Bayesian Networks (BN) Representation Size of a Bayesian Network Inference via BN BN Learning Dynamic BN Introduction Conditional
More informationMidterm: CS 6375 Spring 2015 Solutions
Midterm: CS 6375 Spring 2015 Solutions The exam is closed book. You are allowed a one-page cheat sheet. Answer the questions in the spaces provided on the question sheets. If you run out of room for an
More informationCS246 Final Exam, Winter 2011
CS246 Final Exam, Winter 2011 1. Your name and student ID. Name:... Student ID:... 2. I agree to comply with Stanford Honor Code. Signature:... 3. There should be 17 numbered pages in this exam (including
More informationAnnouncements. CS 188: Artificial Intelligence Fall VPI Example. VPI Properties. Reasoning over Time. Markov Models. Lecture 19: HMMs 11/4/2008
CS 88: Artificial Intelligence Fall 28 Lecture 9: HMMs /4/28 Announcements Midterm solutions up, submit regrade requests within a week Midterm course evaluation up on web, please fill out! Dan Klein UC
More information18.05 Practice Final Exam
No calculators. 18.05 Practice Final Exam Number of problems 16 concept questions, 16 problems. Simplifying expressions Unless asked to explicitly, you don t need to simplify complicated expressions. For
More informationMath 51 Midterm 1 July 6, 2016
Math 51 Midterm 1 July 6, 2016 Name: SUID#: Circle your section: Section 01 Section 02 (1:30-2:50PM) (3:00-4:20PM) Complete the following problems. In order to receive full credit, please show all of your
More informationIntroduction to Machine Learning Midterm Exam
10-701 Introduction to Machine Learning Midterm Exam Instructors: Eric Xing, Ziv Bar-Joseph 17 November, 2015 There are 11 questions, for a total of 100 points. This exam is open book, open notes, but
More information2. (10 pts) How many vectors are in the null space of the matrix A = 0 1 1? (i). Zero. (iv). Three. (ii). One. (v).
Exam 3 MAS 3105 Applied Linear Algebra, Spring 2018 (Clearly!) Print Name: Apr 10, 2018 Read all of what follows carefully before starting! 1. This test has 7 problems and is worth 110 points. Please be
More informationIntroduction to Fall 2011 Artificial Intelligence Final Exam
CS 188 Introduction to Fall 2011 rtificial Intelligence Final Exam INSTRUCTIONS You have 3 hours. The exam is closed book, closed notes except two pages of crib sheets. Please use non-programmable calculators
More information6.867 Machine learning
6.867 Machine learning Mid-term eam October 8, 6 ( points) Your name and MIT ID: .5.5 y.5 y.5 a).5.5 b).5.5.5.5 y.5 y.5 c).5.5 d).5.5 Figure : Plots of linear regression results with different types of
More informationUNIVERSITY of PENNSYLVANIA CIS 520: Machine Learning Final, Fall 2014
UNIVERSITY of PENNSYLVANIA CIS 520: Machine Learning Final, Fall 2014 Exam policy: This exam allows two one-page, two-sided cheat sheets (i.e. 4 sides); No other materials. Time: 2 hours. Be sure to write
More informationCS1800 Discrete Structures Spring 2018 February CS1800 Discrete Structures Midterm Version A
CS1800 Discrete Structures Spring 2018 February 2018 CS1800 Discrete Structures Midterm Version A Instructions: 1. The exam is closed book and closed notes. You may not use a calculator or any other electronic
More information- - - - - - - - - - - - - - - - - - DISCLAIMER - - - - - - - - - - - - - - - - - - General Information: This is a midterm from a previous semester. This means: This midterm contains problems that are of
More informationMidterm. Introduction to Machine Learning. CS 189 Spring Please do not open the exam before you are instructed to do so.
CS 89 Spring 07 Introduction to Machine Learning Midterm Please do not open the exam before you are instructed to do so. The exam is closed book, closed notes except your one-page cheat sheet. Electronic
More informationCS 343: Artificial Intelligence
CS 343: Artificial Intelligence Bayes Nets: Sampling Prof. Scott Niekum The University of Texas at Austin [These slides based on those of Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley.
More informationFinal Exam. 1 True or False (15 Points)
10-606 Final Exam Submit by Oct. 16, 2017 11:59pm EST Please submit early, and update your submission if you want to make changes. Do not wait to the last minute to submit: we reserve the right not to
More informationCS 188: Artificial Intelligence Fall 2008
CS 188: Artificial Intelligence Fall 2008 Lecture 14: Bayes Nets 10/14/2008 Dan Klein UC Berkeley 1 1 Announcements Midterm 10/21! One page note sheet Review sessions Friday and Sunday (similar) OHs on
More informationDesigning Information Devices and Systems I Fall 2016 Babak Ayazifar, Vladimir Stojanovic Midterm 1. Exam location: 145 Dwinelle, last SID# 2
EECS 16A Designing Information Devices and Systems I Fall 2016 Babak Ayazifar, Vladimir Stojanovic Midterm 1 Exam location: 145 Dwinelle, last SID# 2 PRINT your student ID: PRINT AND SIGN your name:, (last)
More informationCS 188: Artificial Intelligence Fall 2008
CS 188: Artificial Intelligence Fall 2008 Lecture 23: Perceptrons 11/20/2008 Dan Klein UC Berkeley 1 General Naïve Bayes A general naive Bayes model: C E 1 E 2 E n We only specify how each feature depends
More informationGeneral Naïve Bayes. CS 188: Artificial Intelligence Fall Example: Overfitting. Example: OCR. Example: Spam Filtering. Example: Spam Filtering
CS 188: Artificial Intelligence Fall 2008 General Naïve Bayes A general naive Bayes model: C Lecture 23: Perceptrons 11/20/2008 E 1 E 2 E n Dan Klein UC Berkeley We only specify how each feature depends
More informationMath 16 - Practice Final
Math 16 - Practice Final May 28th 2007 Name: Instructions 1. In Part A, attempt every question. In Part B, attempt two of the five questions. If you attempt more you will only receive credit for your best
More informationCS 323: Numerical Analysis and Computing
CS 323: Numerical Analysis and Computing MIDTERM #1 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.
More informationSUMMER MATH PACKET. Geometry A COURSE 227
SUMMER MATH PACKET Geometry A COURSE 7 MATH SUMMER PACKET INSTRUCTIONS Attached you will find a packet of exciting math problems for your enjoyment over the summer. The purpose of the summer packet is
More information9 Classification. 9.1 Linear Classifiers
9 Classification This topic returns to prediction. Unlike linear regression where we were predicting a numeric value, in this case we are predicting a class: winner or loser, yes or no, rich or poor, positive
More informationmin 4x 1 5x 2 + 3x 3 s.t. x 1 + 2x 2 + x 3 = 10 x 1 x 2 6 x 1 + 3x 2 + x 3 14
The exam is three hours long and consists of 4 exercises. The exam is graded on a scale 0-25 points, and the points assigned to each question are indicated in parenthesis within the text. If necessary,
More informationtotal 58
CS687 Exam, J. Košecká Name: HONOR SYSTEM: This examination is strictly individual. You are not allowed to talk, discuss, exchange solutions, etc., with other fellow students. Furthermore, you are only
More informationFinal Examination CS540-2: Introduction to Artificial Intelligence
Final Examination CS540-2: Introduction to Artificial Intelligence May 9, 2018 LAST NAME: SOLUTIONS FIRST NAME: Directions 1. This exam contains 33 questions worth a total of 100 points 2. Fill in your
More informationPreparing for the CS 173 (A) Fall 2018 Midterm 1
Preparing for the CS 173 (A) Fall 2018 Midterm 1 1 Basic information Midterm 1 is scheduled from 7:15-8:30 PM. We recommend you arrive early so that you can start exactly at 7:15. Exams will be collected
More information18.05 Final Exam. Good luck! Name. No calculators. Number of problems 16 concept questions, 16 problems, 21 pages
Name No calculators. 18.05 Final Exam Number of problems 16 concept questions, 16 problems, 21 pages Extra paper If you need more space we will provide some blank paper. Indicate clearly that your solution
More informationMidterm Exam 1 (Solutions)
EECS 6 Probability and Random Processes University of California, Berkeley: Spring 07 Kannan Ramchandran February 3, 07 Midterm Exam (Solutions) Last name First name SID Name of student on your left: Name
More informationBayes Networks. CS540 Bryan R Gibson University of Wisconsin-Madison. Slides adapted from those used by Prof. Jerry Zhu, CS540-1
Bayes Networks CS540 Bryan R Gibson University of Wisconsin-Madison Slides adapted from those used by Prof. Jerry Zhu, CS540-1 1 / 59 Outline Joint Probability: great for inference, terrible to obtain
More informationCS 188: Artificial Intelligence Fall 2009
CS 188: Artificial Intelligence Fall 2009 Lecture 14: Bayes Nets 10/13/2009 Dan Klein UC Berkeley Announcements Assignments P3 due yesterday W2 due Thursday W1 returned in front (after lecture) Midterm
More informationCS446: Machine Learning Spring Problem Set 4
CS446: Machine Learning Spring 2017 Problem Set 4 Handed Out: February 27 th, 2017 Due: March 11 th, 2017 Feel free to talk to other members of the class in doing the homework. I am more concerned that
More informationReinforcement Learning Wrap-up
Reinforcement Learning Wrap-up Slides courtesy of Dan Klein and Pieter Abbeel University of California, Berkeley [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley.
More informationFinal. Introduction to Artificial Intelligence. CS 188 Fall You have approximately 2 hours and 50 minutes.
S 188 Fall 2013 Introduction to rtificial Intelligence Final You have approximately 2 hours and 50 minutes. The exam is closed book, closed notes except your one-page crib sheet. Please use non-programmable
More information10-701/ Machine Learning - Midterm Exam, Fall 2010
10-701/15-781 Machine Learning - Midterm Exam, Fall 2010 Aarti Singh Carnegie Mellon University 1. Personal info: Name: Andrew account: E-mail address: 2. There should be 15 numbered pages in this exam
More information